SOME PROBLEMS IN CONNECTION WITH FULL VALUATION: PART II

Improving Local Search Heuristics for some Scheduling Problems. Part II

Local search techniques like simulated annealing and tabu search are based on a neighborhood structure defined on the set of feasible solutions of a discrete optimization problem. For the scheduling problems Pm )I C,,,,, 1 1 prec 1 1 Ui, and a large class of sequencing problems with precedence constraints having local interchange properties we replace a simple neighborhood by a neighborhood on ...

Full Subtracter Circuit. Part II

The articles [17], [16], [21], [15], [3], [18], [25], [1], [9], [10], [4], [8], [2], [19], [24], [14], [20], [13], [12], [11], [23], [5], [7], and [22] provide the terminology and notation for this paper. Let n be a natural number and let x, y be finite sequences. The functor n-BitSubtracterStr(x, y) yields an unsplit non void strict non empty many sorted signature with arity held in gates and ...

Full Adder Circuit. Part II

In this article we continue the investigations from [5] of verification of a design of adder circuit. We define it as a combination of 1-bit adders using schemes from [6]. n-bit adder circuit has the following structure 1st bit adder x 1 y 1 x 2 y 2 r 1 r 2 2nd bit adder nth bit adder x n y n r n As the main result we prove the stability of the circuit. Further works will consist of the proof o...

Part II: Problems

on some bayesian statistical models in actuarial science with emphasis on claim count

چکیده ندارد.